Neighborhood rough sets for dynamic data mining
نویسندگان
چکیده
Junbo Zhang,1,† Tianrui Li,1,∗ Da Ruan,2,3,‡ Dun Liu4,§ School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, People’s Republic of China Belgian Nuclear Research Centre (SCK•CEN), Boeretang 200, 2400 Mol, Belgium Department of Applied Mathematics & Computer Science, Ghent University, 9000 Gent, Belgium School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, People’s Republic of China
منابع مشابه
Neighborhood Selection and Rules Identification for Cellular Automata: A Rough Sets Approach
In this paper a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). According to the proposed approach, neighborhood is detected by reducts calculations and a rulelearning algorithm is applied to induce a set of decision rules that define the evolution of CA. Experiments were performed with ...
متن کاملMin-Uncertainty & Max-Certainty Criteria of Neighborhood Rough- Mutual Feature Selection
Feature Selection (FS) is viewed as an important preprocessing step for pattern recognition, machine learning, and data mining. Most existing FS methods based on rough set theory use the dependency function for evaluating the goodness of a feature subset. However, these FS methods may unsuccessfully be applied on dataset with noise, which determine only information from a positive region but ne...
متن کاملAn Innovative Approach for Attribute Reduction in Rough Set Theory
The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, eliminating those that are redundant or meaningless. Such reducts may even serve as input to other classifiers other than Rough Sets. The typical high dimensionality of current datab...
متن کاملNeighborhood Clustering of Web Users With Rough K-Means
Data collection and analysis in web mining faces certain unique challenges. Due to a variety of reasons inherent in web browsing and web logging, the likelihood of bad or incomplete data is higher than conventional applications. The analytical techniques in web mining need to accommodate such data. Fuzzy and rough sets provide the ability to deal with incomplete and approximate information. Fuz...
متن کاملComposite rough sets for dynamic data mining
As a soft computing tool, rough set theory has become a popular mathematical framework for pattern recognition, data mining and knowledge discovery. It can only deal with attributes of a specific type in the information system by using a specific binary relation. However, there may be attributes of multiple different types in information systems in real-life applications. Such information syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Intell. Syst.
دوره 27 شماره
صفحات -
تاریخ انتشار 2012